Diagnosis as Semiring-Based Constraint Optimization
نویسندگان
چکیده
Overview Diagnosis traditionally viewed as logical reasoning – (de Kleer and Williams 87), (Reiter 87), ... But more naturally viewed as constraint optimization – Minimal set of faulty components, most likely fault, ... Framework that unifies qualitative and quantitative notions of diagnosis using semiring-based CSP – Choose appropriate semiring and construct constraints Diagnosis algorithms based on optimization methods – Dynamic programming with focus on leading solutions
منابع مشابه
A Local Search Framework for Semiring-Based Constraint Satisfaction Problems
Solving semiring-based constraint satisfaction problem (SCSP) is a task of finding the best solution, which can be viewed as an optimization problem. Current research of SCSP solution methods focus on tree search algorithms, which is computationally intensive. In this paper, we present an efficient local search framework for SCSPs, which adopts problem transformation and soft constraint consist...
متن کاملSemiring-based Constraint Logic Programming Content Areas: Constraint Satisfaction, Automated Reasoning
We extend the Constraint Logic Programming (CLP) formalism in order to handle semiring-based constraint systems. This allows us to perform in the same language both constraint solving and optimization. In fact, constraint systems based on semirings are able to model both classical constraint solving and more sophisticated features like uncertainty, probability , fuzzyness, and optimization. We ...
متن کاملSoft constraint abstraction based on semiring homomorphism
The semiring-based constraint satisfaction problems (semiring CSPs), proposed by Bistarelli, Montanari and Rossi [3], is a very general framework of soft constraints. In this paper we propose an abstraction scheme for soft constraints that uses semiring homomorphism. To find optimal solutions of the concrete problem, the idea is, first working in the abstract problem and finding its optimal sol...
متن کاملHigher Order Semiring-based Constraints
Semiring-based constraint problems (SCSPs) [BMR95,BMR97] extend classical constraint problems (CSPs) by allowing preferences, costs, priorities, probabilities, and other soft features. They are based over the notion of a semiring, that is, a set plus two operations. In this paper we introduce a uniform, abstract presentation of (soft) constraint satisfaction concepts and constructions. Moreover...
متن کاملSemiring-based Constraint Logic Programming
We extend the Constraint Logic Programming (CLP) formalism in order to handle semiringbased constraint systems. This allows us to perform in the same language both constraint solving and optimization. In fact, constraint systems based on semirings are able to model both classical constraint solving and more sophisticated features like uncertainty, probability, fuzzyness, and optimization. We th...
متن کامل